Histogram - Based Performance Analysis for Computer

نویسنده

  • Shikharesh Majumdar
چکیده

A conventional analytic model used for evaluating the performance of computer and communication systems accepts single values as model inputs and computes a single value for each performance measure of interest. However uncertainties regarding parameter values exist in diierent situations such as during early stages of system design. Although the clients in a system are statistically identical factors such as the time of the day and the current size of the data les can introduce variabilities in service demands for the server devices. Existence of uncertainties or variabilities in service demands makes the use of a single mean value for each model parameter inappropriate causing the conventional modelling approach to become ineeective. This paper proposes to use histograms for characterizing one or more model parameters that are associated with such uncertainty or variability and demonstrates its application with separable queueing network models. A histogram consists of a number of intervals (ranges) with a probability of occurrence associated with each interval. The adaptation of the existing solution techniques for both open and closed queueing networks to histogram parameters is presented in the paper. One or more input parameters for the model can be speciied as a histogram and a histogram is generated for the model output. Such a histogram output is also appropriate when percentile values for performance measures are required in addition to the mean value. Examples of the application of these techniques to diierent problem domains and the computational complexity of the technique are discussed. The cost associated with running the algorithm is observed to be reasonable as long as the number of devices whose demands are speciied as histograms is not too high. Although the algorithm produces accurate results in many situations inaccuracies have been observed for certain systems. A technique called interval splitting that can be used for controlling such inaccuracies is described. 1 (per sec) 2 (per sec) (per sec) RT (sec) RT 1 (sec) RT 2 (sec) RT (sec) (period 1) (period 2) (aggregated) (aggregated) (period 1) (period 2) (overall)

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A General Framework for 1-D Histogram-baesd Image Contrast Enhancement

In this paper, a general framework for image contrast enhancement algorithm based on an optimization problem is presented. Through this optimization, the intensities can be better distributed. The algorithm is based on the facts that the histogram of the enhanced image is close to the input image histogram and uniform distribution, simultaneously. Based on this fact, we obtain a closed form opt...

متن کامل

Density-Based Histogram Partitioning and Local Equalization for Contrast Enhancement of Images

Histogram Equalization technique is one of the basic methods in image contrast enhancement. Using this method, in the case of images with uniform gray levels (with narrow histogram), causes loss of image detail and the natural look of the image. To overcome this problem and to have a better image contrast enhancement, a new two-step method was proposed. In the first step, the image histogram is...

متن کامل

Visual Tracking using Learning Histogram of Oriented Gradients by SVM on Mobile Robot

The intelligence of a mobile robot is highly dependent on its vision. The main objective of an intelligent mobile robot is in its ability to the online image processing, object detection, and especially visual tracking which is a complex task in stochastic environments. Tracking algorithms suffer from sequence challenges such as illumination variation, occlusion, and background clutter, so an a...

متن کامل

Color scene transform between images using Rosenfeld-Kak histogram matching method

In digital color imaging, it is of interest to transform the color scene of an image to the other. Some attempts have been done in this case using, for example, lαβ color space, principal component analysis and recently histogram rescaling method. In this research, a novel method is proposed based on the Resenfeld and Kak histogram matching algorithm. It is suggested that to transform the color...

متن کامل

A New IRIS Segmentation Method Based on Sparse Representation

Iris recognition is one of the most reliable methods for identification. In general, itconsists of image acquisition, iris segmentation, feature extraction and matching. Among them, iris segmentation has an important role on the performance of any iris recognition system. Eyes nonlinear movement, occlusion, and specular reflection are main challenges for any iris segmentation method. In thi...

متن کامل

A New IRIS Segmentation Method Based on Sparse Representation

Iris recognition is one of the most reliable methods for identification. In general, itconsists of image acquisition, iris segmentation, feature extraction and matching. Among them, iris segmentation has an important role on the performance of any iris recognition system. Eyes nonlinear movement, occlusion, and specular reflection are main challenges for any iris segmentation method. In thi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995